Quantum error-correcting codes from algebraic geometry codes of Castle type
نویسندگان
چکیده
منابع مشابه
Quantum error-correcting codes from Algebraic Geometry codes of Castle type
We study Algebraic Geometry codes producing quantum error-correcting codes by the CSS construction. We pay particular attention to the family of Castle codes. We show that many of the examples known in the literature in fact belong to this family of codes. We systematize these constructions by showing the common theory that underlies all of them.
متن کاملQuantum error-correcting codes from algebraic curves
This chapter discusses quantum error-correcting codes constructed from algebraic curves. We give an introduction to quantum coding theory including bounds on quantum codes. We describe stabilizer codes which are the quantum analog of classical linear codes and discuss the binary and q-ary CSS construction. Then we focus on quantum codes from algebraic curves including the projective line, Hermi...
متن کاملSome good quantum error-correcting codes from algebraic-Geometric codes
It is shown that the quantum error-correction can be acheived by the using of classical binary codes or additive codes over F4 (see [1],[2],[3]). In this paper with the help of some algebraic techniques the theory of algebraic-geometric codes is used to construct asymptotically good family of quantum error-correcting codes and other classes of good quantum error-correcting codes. Our results ar...
متن کاملAlgebraic Geometry Codes from Castle Curves
The quality of an algebraic geometry code depends on the curve from which the code has been defined. In this paper we consider codes obtained from Castle curves, namely those whose number of rational points attains Lewittes’ bound for some rational point Q and the Weierstrass semigroup at Q is symmetric.
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2016
ISSN: 1570-0755,1573-1332
DOI: 10.1007/s11128-016-1378-9